Remarks on Thatte's transformation of term rewriting systems
نویسندگان
چکیده
We carry out a detailed analysis of Thatte’s transformation of term rewriting systems. We refute an earlier claim that this transformation preserves confluence for weakly persistent systems. We prove the preservation of weak normalization, and of confluence in weakly normalizing systems and in nonoverlapping systems with linear subtemplates. We conclude by proving that weak persistence is an undecidable property of term rewriting systems.
منابع مشابه
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof
In 8], Thatte demonstrated the possibility of simulating an orthogonal TRS with a left-linear constructor system obtained from the original system via a simple transformation. The class of strongly sequential systems (SS) was deened in 3]. In 2], we have deened the class of constructor equivalent systems (CE) for which Thatte's transformation preserves strong sequentiality; in that same article...
متن کاملTransformation of Reduction Systems a View on Proving Correctness Transformation of Reduction Systems a View on Proving Correctness
was centered around two questions: 1. What are good notions for proving correctness of transformations for Reduction Systems? 2. Does Thatte's transformation preserve connuence for the class of weakly persistent systems? Jan Bergstra helped me with the rst question and was my supervisor in the rst part of the project. We had long talks about computer science, university, and other things. Those...
متن کاملSound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. More precisely, we show that every weakly-leftlinear deterministic conditional term rewriting system can be converted to an equivalent weakly-leftline...
متن کاملOn Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation∗
This paper improves the existing criterion for proving confluence of a normal conditional term rewriting system (CTRS) via the Şerbănuţă-Roşu transformation, a computationally equivalent transformation of CTRSs into unconditional term rewriting systems (TRS), showing that a weakly left-linear normal CTRS is confluent if the transformed TRS is confluent. Then, we discuss usefulness of the optimi...
متن کاملOn Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is sound for weakly left-linear normal conditional term rewriting systems (CTRS). Here, soundness for a CTRS means that reduction of the transformed unconditional term rewriting system (TRS) creates no undesired reduction for the CTRS. We first show that every reduction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 195 شماره
صفحات -
تاریخ انتشار 2004